Efficient Robust Routing for Single Commodity Network Flows

Multicommodity vs. Single-Commodity Routing

In most of the literature on vehicle routing problems, a single numeric value expresses the demand of a customer. The typical constraint is that the total demand served by a vehicle cannot exceed the vehicle capacity. It is usually understood that all vehicles can serve all customers. If different commodities require different vehicles, it is assumed that, in a previous phase, it has been decid...

Single source single-commodity stochastic network design

Stochastics affects the optimal design of a network. This paper examines the single-source single-commodity stochastic network design problem. We characterize the optimal designs under demand uncertainty and compare with the deterministic counterparts to outline the basic structural differences. We do this partly as a basis for developing better algorithms than are available today, partly to si...

Robust and Adaptive Network Flows

Augmenting flows for the consistent migration of multi-commodity single-destination flows in SDNs

Updating network flows in a real-world setting is a nascent research area, especially with the recent rise of Software Defined Networks. While augmenting s-t flows of a single commodity is a well-understood concept, we study updating flows in a multi-commodity setting: Given a directed network with flows of different commodities, how can the capacity of some commodities be increased, without re...

Evolutionary Computing Assisted Wireless Sensor Network Mining for QoS-Centric and Energy-efficient Routing Protocol

The exponential rise in wireless communication demands and allied applications have revitalized academia-industries to develop more efficient routing protocols. Wireless Sensor Network (WSN) being battery operated network, it often undergoes node death-causing pre-ma...